Sparsity and dimension
نویسندگان
چکیده
We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Nešetřil and Ossona de Mendez as a model for sparsity in graphs, is a property that is naturally satisfied by a wide range of graph classes, from graph structure theory (graphs excluding a minor or a topological minor) to graph drawing (e.g. graphs with constant book thickness). Therefore, our theorem generalizes a number of results including the most recent one for posets of bounded height with cover graphs excluding a fixed graph as a topological minor. We also show that the result is in a sense best possible, as it does not extend to nowhere dense classes; in fact, it already fails for cover graphs with locally bounded treewidth.
منابع مشابه
A NOVEL FUZZY-BASED SIMILARITY MEASURE FOR COLLABORATIVE FILTERING TO ALLEVIATE THE SPARSITY PROBLEM
Memory-based collaborative filtering is the most popular approach to build recommender systems. Despite its success in many applications, it still suffers from several major limitations, including data sparsity. Sparse data affect the quality of the user similarity measurement and consequently the quality of the recommender system. In this paper, we propose a novel user similarity measure based...
متن کاملSub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity
We prove that the Fourier dimension of any Boolean function with Fourier sparsity s is at most O ( s ) . Our proof method yields an improved bound of Õ( √ s) assuming a conjecture of Tsang et. al. [TWXZ13], that for every Boolean function of sparsity s there is an affine subspace of F2 of co-dimension O(poly log s) restricted to which the function is constant. This conjectured bound is tight up...
متن کاملNear-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
We prove that the Fourier dimension of any Boolean function with Fourier sparsity s is at most O ( √ s log s). This bound is tight upto a factor of log s as the Fourier dimension and sparsity of the address function are quadratically related. We obtain the bound by observing that the Fourier dimension of a Boolean function is equivalent to its non-adaptive parity decision tree complexity, and t...
متن کاملSparsity and the Possibility of Inference
We discuss the importance of sparsity in the context of nonparametric regression and covariance matrix estimation. We point to low manifold dimension of the covariate vector as a possible important feature of sparsity, recall an estimate of dimension due to Levina and Bickel (2005) and establish some conjectures made in that paper. AMS (2000) subject classification. Primary 62-02, 62G08, 62G20,...
متن کاملCompressive Sensing in Speech Processing: A Survey Based on Sparsity and Sensing Matrix
Compressive sampling is an emerging technique that promises to effectively recover a sparse signal from far fewer measurements than its dimension. The compressive sampling theory assures almost an exact recovery of a sparse signal if the signal is sensed randomly where the number of the measurements taken is proportional to the sparsity level and a log factor of the signal dimension. Encouraged...
متن کاملA Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کامل